Optimal Strategies in Weighted Limit Games
نویسندگان
چکیده
منابع مشابه
Optimal Strategies in Linguistic Games
Why is this book in English? An insider can offer several answers, such as these: 1. Because the Editorial Group insisted that all papers be in English. 2. Because English is the native language of the book's honoree. 3. Because all of the authors can write in English, and some can write only in English. 4. Because Mouton can sell more copies of an all-English book than of a plurilingual book. ...
متن کاملOptimal Cost-Sharing in Weighted Congestion Games
We identify how to share costs locally in weighted congestion games with polynomial cost functions to minimize the worst-case price of anarchy (POA). First, we prove that among all cost-sharing methods that guarantee the existence of pure Nash equilibria, the Shapley value minimizes the worst-case POA. Second, if the guaranteed existence condition is dropped, then the proportional cost-sharing ...
متن کاملOptimal Reachability in Divergent Weighted Timed Games
Weighted timed games are played by two players on a timed automaton equipped with weights: one player wants to minimise the accumulated weight while reaching a target, while the other has an opposite objective. Used in a reactive synthesis perspective, this quantitative extension of timed games allows one to measure the quality of controllers. Weighted timed games are notoriously difficult and ...
متن کاملPseudo-Optimal Strategies in No-Limit Poker
Games have always been a strong driving force in artificial intelligence. In the last ten years huge improvements have been made in perfect information games like chess and othello and the strongest computer agents can beat the strongest human players. This is not the case for imperfect information games such as poker and bridge where creating an expert computer player has shown to be much hard...
متن کاملSequential games and optimal strategies
This article gives an overview of recent work on the theory of selection functions. We explain the intuition behind these higher type objects, and define a general notion of sequential game whose optimal strategies can be computed via a certain product of selection functions. Several instances of this game are considered in a variety of areas such as fixed point theory, topology, game theory, h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2020
ISSN: 2075-2180
DOI: 10.4204/eptcs.326.8